A Unifying Conservation Law for Single-server Queues
نویسنده
چکیده
We develop a conservation law for a multi-class GI/GI/1 queue operating under a general work-conserving scheduling discipline. For single-class single-server queues, conservation laws have been obtained for both nonanticipating and anticipating disciplines with general service time distributions. For multi-class single-server queues, conservation laws have been obtained for (i) nonanticipating disciplines with exponential service time distributions and (ii) nonpreemptive nonanticipating disciplines with general service time distributions. The unifying conservation law we develop generalizes already existing conservation laws. In addition, it covers popular nonanticipatingmulti-class time-sharing disciplines such as discriminatory processor sharing (DPS) and generalized processor sharing (GPS) with general service time distributions. As an application, we show that the unifying conservation law can be used to compare the expected unconditional response time under two scheduling disciplines.
منابع مشابه
A unifying onservation law for single-server queues
Urtzi Ayesta LAAS-CNRS 7, Avenue Colonel Ro he 31077, Toulouse e-mail: urtzi laas.fr Abstra t We develop a onservation law for a multilass GI/GI/1 queue operating under a general workonserving s heduling dis ipline. For singlelass single-server queues, onservation laws have been obtained for both non-anti ipating and anti ipating dis iplines with general servi e time distributions. For multilas...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملPolling systems with a gated/exhaustive discipline
We consider a polling system where the server cyclically serves the queues according to the following discipline: the server does one round of visits to the queues applying the gated service discipline at each of the queues, followed by one round of visits applying the exhaustive service discipline at each of the queues, and this alternating pattern repeats itself. We call this the Gated/Exhaus...
متن کاملUnreliable bulk retrial queues with delayed repairs and modified vacation policy
The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...
متن کاملOn the Sojourn times for Many-queue Head-of-the-line Processor-sharing Systems with Permanent Customers on the Sojourn times for Many-queue Head-of-the-line Processor-sharing Systems with Permanent Customers 1
We consider a single server system consisting of n queues with diierent types of customers (Poisson streams) and k permanent customers. The permanent customers and those at the head of the queues are served in processor-sharing by the service facility (head-of-the-line processor-sharing). The stability condition and a pseudo work conservation law will be given for arbitrary service time distrib...
متن کامل